On adaptive resource allocation for complex real-time application

Resource allocation for high-performance real-time applications is challenging due to the applications’ data-dependent nature, dynamic changes in their external environment, and limited resource availability in their target embedded system platforms. These challenges may be met by use of Adaptive Resource Allocation (ARA) mechanisms that can promptly adjust resource allocation to changes in an application’s resource needs, whenever there is a risk of failing to satisfy its timing constraints. By taking advantage of an application’s adaptation capabilities, ARA eliminates the need for ‘over-sizing’ real-time systems to meet worst-case application needs. This paper proposes a model for describing an application’s adaptation capabilities and the runtime variation of its resource needs. The paper also proposes a satisfiability-driven set of performance metrics for capturing the impact of ARA mechanisms on the performance of adaptable real-time applications. The relevance of the proposed set of metrics is demonstrated experimentally, using a synthetic application designed to represent time-critical applications in C3I systems. College of Computing Georgia Institute of Technology Atlanta, Georgia 30332–0280 Funded in part by DARPA through the Honeywell Technology Center under Contract No. B09332478 and Contract No. B09333218, and by NSF equipment grants CDA-9501637, CDA-9422033 and ECS-9411846. On Adaptive Resource Allocation for Complex Real-Time Applications Daniela Roşu, Karsten Schwan, Sudhakar Yalamanchili Georgia Institute of Technology 801 Atlantic Drive, Atlanta, GA 30332-0208 f daniela,schwan [email protected] [email protected] Rakesh Jha Honeywell Technology Center 3660 Technology Drive Minneapolis, MN-55418 [email protected]